A Heuristic Proof Procedure for First-Order Logic
نویسندگان
چکیده
منابع مشابه
A Heuristic Proof Procedure for First-Order Logic
Inspired by the efficient proof procedures discussed in Computability logic [1, 4, 5], we describe a heuristic proof procedure for first-order logic. This is a variant of Gentzen sequent system and has the following features: (a) it views sequents as games between the machine and the environment, and (b) it views proofs as a winning strategy of the machine. From this game-based viewpoint, a pow...
متن کاملProof Theory for First Order Lukasiewicz Logic
An approximate Herbrand theorem is proved and used to establish Skolemization for first-order Łukasiewicz logic. Proof systems are then defined in the framework of hypersequents. In particular, extending a hypersequent calculus for propositional Łukasiewicz logic with usual Gentzen quantifier rules gives a calculus that is complete with respect to interpretations in safe MV-algebras, but lacks ...
متن کاملProof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal Logic (FOLTL), which can be seen as a quantified version of Linear Temporal Logic, overcoming its finitary limitation. Automated reasoning in FOLTL is hard, since it is non-recursively enumerable; but its expressivenes...
متن کاملA proof of completeness for continuous first-order logic
Continuous first-order logic has found interest among model theorists who wish to extend the classical analysis of “algebraic” structures (such as fields, group, and graphs) to various natural classes of complete metric structures (such as probability algebras, Hilbert spaces, and Banach spaces). With research in continuous first-order logic preoccupied with studying the model theory of this fr...
متن کاملA General Proof Method for First-Order Modal Logic
We present a general sequent-based proof method for first-order modal logics in which the Barcan formula holds. The most important feature of our system is the fact that it has identical inference rules for every modal logic; different modal logics can be obtained by changing the conditions under which two formulas are allowed to resolve against each other It is argued that the proof method is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEICE Transactions on Information and Systems
سال: 2020
ISSN: 0916-8532,1745-1361
DOI: 10.1587/transinf.2019fcl0003